Search results for "Street network"

showing 3 items of 3 documents

On the Distance-Constrained Close Enough Arc Routing Problem

2021

[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman Problem, does not assume that customers are located at specific arcs, but can be serviced by traversing any arc of a given subset. Real-life applications include routing for meter reading, in which a vehicle equipped with a receiver travels a street network. If the vehicle gets within a certain distance of a meter, the receiver collects its data. Therefore, only a few streets which are close enough to the meters need to be traversed. In this paper we study the generalization…

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceClose-enoughComputer scienceHeuristic (computer science)0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringSet (abstract data type)Rural Postman0502 economics and businessDistance constraintsRouting050210 logistics & transportation021103 operations researchHeuristic05 social sciencesBranch and cutModeling and SimulationBenchmark (computing)Routing (electronic design automation)MATEMATICA APLICADAArc routingAutomatic meter readingStreet network
researchProduct

In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem

2015

Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182] presented a cut-first branch-and-price-second algorithm for solving the capacitated arc-routing problem (CARP). The fundamental difference to other approaches for exactly solving the CARP is that the entire algorithm works directly on the typically sparse underlying graph representing the street network. This enables the use of highly efficient dynamic programming-based pricing algorithms to solve the column-generation subproblem also known as the pricing problem. The contribution of this paper is the in-depth analysis of the CARP pricing…

Dynamic programmingMathematical optimizationBranch and priceBenchmark (computing)EconomicsGraph (abstract data type)TransportationColumn generationSystematic variationArc routingCivil and Structural EngineeringStreet networkTransportation Science
researchProduct

Dual Multilevel Urban Drainage Model

2005

In urban areas, when heavy rains occur, the discharge capacity of sewers is usually unable to transport the effective rainfall reaching the streets. When the runoff flow rate exceeds the capacity of the storm sewer system, the excess flow is conveyed through the street network as overland flow. A dual model is proposed for modeling the system as a double network, formed by an upper network of open channels (street gutters) and a lower network of closed conduits (sewer pipes). What is new in this model is its capacity to take into account the hydrodynamic relationship between the flows in the upper and lower networks. The model is applied to computing the response of a real monitored basin; …

HydrologyHydraulicsMechanical EngineeringFlow (psychology)Surface runoffSettore ICAR/01 - Idraulicalaw.inventionAlgorithmSurchargelawSewerageEnvironmental scienceSanitary sewerDrainageHydraulic modelSurface runoffOutfall sewerUrban runoffWater Science and TechnologyCivil and Structural EngineeringStreet networkUrban runoffJournal of Hydraulic Engineering
researchProduct